Face Searching and Matching Using Gray Scale Diagonal Square Matrix

نویسنده

  • Suresh Joseph
چکیده

----------------------------------------------------------------------ABSTRACT-------------------------------------------------------------------This paper presents a novel approach in face digital image searching and matching. The given key image is converted into gray scale image and after that a matrix is computed with gray scale values of the key image. Then we are collecting the diagonal key elements for diagonal searching key sequence. Using Pair wise sequence alignment we are trying to match the key with available images in the large data base of collection of faces. Initially we discussed various techniques used in digital image searching and matching in this paper. This new algorithm Diagonal matrix is a new algorithm for all face images searching and matching. Face recognition is very essential in the field of criminology. Face Image searching and matching are very difficult task in image processing; there are several algorithms for face image matching. But still needs more optimization for image matching. Using this new approach we can match criminal photo from a large database. Face Image recognition, feature extraction and pattern matching needs improvements in Image processing. There are several methods for Face image searching and matching, but we need new optimized technique for image searching and matching. This new Diagonal matrix approach is tried to give optimized solution in Face digital image matching.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Face Recognition Method Based on Local Feature Analysis

Elastic Bunch Graph Matching has been proved effective for face recognition. But the recognition procedure needs large computation. Here we present an automatic face recognition method based on local feature analysis. The local features are firstly located by the face structure knowledge and gray level distribution information, rather than searching on the whole image as it does in Elastic Bunc...

متن کامل

Hvdlp : Horizontal Vertical Diagonal Local Pattern Based Face Recognition

Face image is an efficient biometric trait to recognize human beings without expecting any co-operation from a person. In this paper, we propose HVDLP: Horizontal Vertical Diagonal Local Pattern based face recognition using Discrete Wavelet Transform (DWT) and Local Binary Pattern (LBP). The face images of different sizes are converted into uniform size of 108×990and color images are converted ...

متن کامل

Folding Transitions of the Square-Diagonal Lattice

We address the problem of ”phantom” folding of the tethered membrane modelled by the two-dimensional square lattice, with bonds on the edges and diagonals of each face. Introducing bending rigidities K1 and K2 for respectively long and short bonds, we derive the complete phase diagram of the model, using transfer matrix calculations. The latter displays two transition curves, one corresponding ...

متن کامل

Centralized Clustering Method To Increase Accuracy In Ontology Matching Systems

Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

متن کامل

Approximate graph matching

In this paper, vectors are column vectors. Unless otherwise specified, the norm of a matrix ‖M‖ is the Frobenius norm, defined by ‖M‖ = √∑ i,jM 2 ij . The all ones vector is denoted 1 and the all zeros vector is denoted 0. The all ones matrix is denoted J and the all zeros matrix is denoted O. The n× n identity matrix is denoted In, or simply I if its size is understood from context. The vector...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010